Efficient spatial designs using Hausdorff distances and Bayesian optimization

نویسندگان

چکیده

An iterative Bayesian optimization technique is presented to find spatial designs of data that carry much information. We use the decision theoretic notion value information as design criterion. Gaussian process surrogate models enable fast calculations expected improvement for a large number designs, while full-scale evaluations are only done most promising designs. The Hausdorff distance used model similarity between in covariance representation, and this allows suggested algorithm learn across different study properties synthetic example real-world examples from forest conservation petroleum drilling operations. In we consider where exact solution available run under versions compare it with existing approaches such sequential selection an exchange algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hausdorff Distances Between Distributions Using Optimal Transport and Mathematical Morphology

In this paper we address the question of defining and computing Hausdorff distances between distributions in a general sense. We exhibit some links between Prokhorov-Lévy distances and dilation-based distances. In particular, mathematical morphology provides an elegant way to deal with periodic distributions. The case of possibility distributions is addressed using fuzzy mathematical morphology...

متن کامل

Some Properties of Gromov-Hausdorff Distances

The Gromov–Hausdorff distance between metric spaces appears to be a useful tool for modeling some object matching procedures. Since its conception it has been mainly used by pure mathematicians who are interested in the topology generated by this distance, and quantitative consequences of the definition are not very common. As a result, only few lower bounds for the distance are known, and the ...

متن کامل

Privacy Spatial and Temporal Distances in Nomadic Settelments

Human always in interaction with their social environment, have consider some degree of privacy with different purposes, for themselves, the people around them and carry out their activities. Creating privacy depends on two elements; subjective meanings that ruling the creation of privacy, and the second sentence are person available facilities. Privacy is not seen, heard, smelled and availabil...

متن کامل

Adaptive Hausdorff distances and dynamic clustering of symbolic interval data

This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocation algorithms involving the construction of the clusters at each iteration and the identification of a suitable representation or prototype (means, axes, probability laws, groups of elements, etc.) for each cluster by l...

متن کامل

Adaptative Hausdorff Distances and Dynamic Clustering of Symbolic Interval Data

This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocation algorithms involving the construction of the clusters at each iteration and the identification of a suitable representation or prototype (means, axes, probability laws, groups of elements, etc.) for each cluster by l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scandinavian Journal of Statistics

سال: 2021

ISSN: ['0303-6898', '1467-9469']

DOI: https://doi.org/10.1111/sjos.12554